Constrained forms of statistical minimax :

نویسنده

  • Martin J. Wainwright
چکیده

A fundamental quantity in statistical decision theory is the notion of the minimax risk as5 sociated with an estimation problem. It is based on a saddlepoint problem, in which nature plays the 6 role of adversary in choosing the underlying problem instance, and the statistician seeks an estimator 7 with good properties uniformly over a class of problem instances. We argue that in many modern 8 estimation problems arising in the mathematical sciences, the classical notion of minimax risk suf9 fers from a significant deficiency: to wit, it allows for all possible estimators, including those with 10 prohibitive computational costs, unmanageable storage requirements, or other undesirable properties. 11 Accordingly, we introduce some refinements of minimax risk based on imposing additional constraints 12 on the sets of possible estimators. We illustrate this notion of constrained statistical minimax via three 13 vignettes, based on restrictions involving computation, communication, and privacy, respectively. 14 Mathematics Subject Classification (2010). Primary 62Cxx; Secondary 68W40. 15

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truncated Linear Minimax Estimator of a Power of the Scale Parameter in a Lower- Bounded Parameter Space

 Minimax estimation problems with restricted parameter space reached increasing interest within the last two decades Some authors derived minimax and admissible estimators of bounded parameters under squared error loss and scale invariant squared error loss In some truncated estimation problems the most natural estimator to be considered is the truncated version of a classic...

متن کامل

A Robust Information Clustering Algorithm

We focus on the scenario of robust information clustering (RIC) based on the minimax optimization of mutual information (MI). The minimization of MI leads to the standard mass-constrained deterministic annealing clustering, which is an empirical risk-minimization algorithm. The maximization of MI works out an upper bound of the empirical risk via the identification of outliers (noisy data point...

متن کامل

On the Minimax Optimality of Block Thresholded Wavelets Estimators for ?-Mixing Process

We propose a wavelet based regression function estimator for the estimation of the regression function for a sequence of ?-missing random variables with a common one-dimensional probability density function. Some asymptotic properties of the proposed estimator based on block thresholding are investigated. It is found that the estimators achieve optimal minimax convergence rates over large class...

متن کامل

Optimal Rates of Statistical Seriation

Given a matrix, the seriation problem consists in permuting its rows in such way that all its columns have the same shape, for example, they are monotone increasing. We propose a statistical approach to this problem where the matrix of interest is observed with noise and study the corresponding minimax rate of estimation of the matrices. Specifically, when the columns are either unimodal or mon...

متن کامل

A New Objective Penalty Function Approach for Solving Constrained Minimax Problems

In this paper, a new objective penalty function approach is proposed for solving minimax programming problems with equality and inequality constraints. This new objective penalty function combines the objective penalty and constraint penalty. By the new objective penalty function, a constrained minimax problem is converted to minimizations of a sequence of continuously differentiable functions ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014